Search for: All records

Given two unital C*-algebras equipped with states and a positive operator in the enveloping von Neumann algebra of their minimal tensor product, we define three parameters that measure the capacity of the operator to align with a coupling of the two given states. Further, we establish a duality formula that shows the equality of two of the parameters for operators in the minimal tensor product of the relevant C*-algebras. In the context of abelian C*-algebras, our parameters are related to quantitative versions of Arveson's null set theorem and to dualities considered in the theory of optimal transport. On the other hand, restricting to matrix algebras we recover and generalize quantum versions of Strassen's theorem. We show that in the latter case our parameters can detect maximal entanglement and separability. 

Abstract We introduce and examine three subclasses of the family of quantum no-signalling (QNS) correlations introduced by Duan and Winter: quantum commuting, quantum and local. We formalise the notion of a universal TRO of a block operator isometry, define an operator system, universal for stochastic operator matrices, and realise it as a quotient of a matrix algebra. We describe the classes of QNS correlations in terms of states on the tensor products of two copies of the universal operator system and specialise the correlation classes and their representations to classical-to-quantum correlations. We study various quantum versions of synchronous no-signalling correlations and show that they possess invariance properties for suitable sets of states. We introduce quantum non-local games as a generalisation of non-local games. We define the operation of quantum game composition and show that the perfect strategies belonging to a certain class are closed under channel composition. We specialise to the case of graph colourings, where we exhibit quantum versions of the orthogonal rank of a graph as the optimal output dimension for which perfect classical-to-quantum strategies of the graph colouring game exist, as well as to non-commutative graph homomorphisms, where we identify quantum versions of non-commutative graph homomorphisms introduced by Stahlke.